Mapping Of Backpropagation Learning Onto Distributed Memory Multiprocessors
نویسندگان
چکیده
This paper presents a mapping scheme for p a d e l pipelined execution of the Backpropagation Learning Algorithm o n dtktributed memory multiprocessors (DMMs). The proposed implementation ezhibits training set parallelism that involves batch updating. Simple algorithms have been presented, which allow the data transfer involved in both forward and backward execution3 phases of the backpropagation algorithm t o be carried out with a small communication overhead. The egectiveness of our mapping has been illustrated, by estimating the speedup of a proposed implementation on an away of T-805 transputers.
منابع مشابه
An efficient mapping of Boltzmann Machine computations onto distributed-memory multiprocessors
Oh, D.H., J.H. Nang, H. Yoon and S.R. Maeng, An efficient mapping of Boltzmann Machine computations onto distributedmemory multiprocessors, Microprocessing and Microprogramming 33 (1991/92) 223-236. In this paper, an efficient mapping scheme of Boltzmann Machine computations onto a distributed-memory multiprocessor, which exploits the synchronous spatial parallelism, is presented. In this schem...
متن کاملEfficient mapping of backpropagation algorithm onto a network of workstations
In this paper, we present an efficient technique for mapping a backpropagation (BP) learning algorithm for multilayered neural networks onto a network of workstations (NOW's). We adopt a vertical partitioning scheme, where each layer in the neural network is divided into p disjoint partitions, and map each partition onto an independent workstation in a network of p workstations. We present a fu...
متن کاملOn Automatic Loop Data-Mapping for Distributed-Memory Multiprocessors
In this paper we present a unified approach for compiling programs for Distributed-Memory Multiprocessors (DMM). Parallelization of sequential programs for DMM is much more difficult to achieve than for shared memory systems due to the exclusive local memory of each Virtual Processor (VP). The approach presented distributes computations among VPs of the system and maps data onto their private m...
متن کاملInterleaving Partitions of Systolic Algorithms for Programming Distributed Memory Multiprocessors
In this paper we present a systematic method for mapping systolizable problems onto Distributed Memory Multiprocessors. A systolizable problem is a problem for which it is possible to design a Systolic Algorithm. As a first stage, we design a Systolic Algorithm for the problem to be solved. Then, different transformations are applied to this Systolic Algorithm in order to adapt it to the availa...
متن کاملMapping nested loops onto distributed memory multiprocessors
This paper presents Chain grouping; a new low complexity method for the problem of partitioning the index space into groups with little intercommunication requirements, for mapping onto distributed mesh-connected architectures. First the loop iterations are scheduled in time, according to the hyperplane method, taking into consideration the minimum time displacement. Then, the index space is di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008